A lightweight-friendly modifcation of GOST block cipher

نویسندگان

  • Andrey Dmukh
  • Denis Dygin
  • Grigory Marshalko
چکیده

We study the possibility of GOST block cipher modification in such way, that it would resist Isobe and Dinur-Dunkelman-Shamir attacks, and, at the same time, would be still lightweight-friendly.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Fixed Point Attacks on GOST2 Block Cipher

GOST block cipher designed in the 1970s and published in 1989 as the Soviet and Russian standard GOST 28147-89. In order to enhance the security of GOST block cipher after proposing various attacks on it, designers published a modified version of GOST, namely GOST2, in 2015 which has a new key schedule and explicit choice for S-boxes. In this paper, by using three exactly identical portions of ...

متن کامل

Quasigroup representation of some lightweight block ciphers

Most of the lightweight block ciphers are build as S-P networks or Feistel networks, their generalization or variations. We represent the lightweight Feistel ciphers GOST and MIBS, and Generalized Feistel cipher Skipjack by quasigroup string transformations. For obtaining suitable representation we use the fact that Feistel round functions that are bijections can be considered as orthomorphisms...

متن کامل

Halka: A Lightweight, Software Friendly Block Cipher Using Ultra-lightweight 8-bit S-box

This paper presents the design of a lightweight, yet software friendly, block cipher. Most of the lightweight block ciphers are nibbleoriented as the implementation of a 4-bit S-box is much more compact than an 8-bit S-box. This paper uses a novel implementation of multiplicative inverse for 8-bit S-boxes using LFSR requiring only 138 gateequivalent. With this powerful scheme, we design a light...

متن کامل

Local reduction and the algebraic cryptanalysis of the block cipher gost

In our constribution we explore a combination of local reduction with the method of syllogisms and the applications of generic guessing strategies in the cryptanalysis of the block cipher GOST. Our experiments show that GOST with 64/128/256 bit key requires at least 12/16/22 rounds to achieve full bit security against the method of syllogisms combined with the ,,maximum impact” strategy.

متن کامل

Modified S-box to Archive Accelerated GOST

The block cipher GOST was proposed in former Soviet Union in 1989. In this paper we present the principal algorithm of GOST block with reduced number of rounds. By introducing the idea reduced round version of GOST the modules speed processing of using a set of differential characteristics, we can simply increase the effectiveness and estimate the efficient for cryptosystem. We describe GOST an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2015  شماره 

صفحات  -

تاریخ انتشار 2015